The μ-way intersection problem for cubes
نویسندگان
چکیده
A collection of Il 3-cube decompositions of a graph G is said to have intersection size t if there is a set S, with 181 = t, of 3-cubes which is contained in every decomposition, and no 3-cube which is not in S occurs in more than one decomposition. We determine all integers n, t and Il, with Il ::; 12, for which there exists a collection of Il 3-cube decompositions of Kn with intersection size t. Also, we determine all integers m, n, t and Il, with Il ::; 8, for which there exists a collection of Il 3-cube decompositions of Km,n with intersection size t.
منابع مشابه
Synthesizing cubes to satisfy a given intersection pattern
In two-level logic synthesis, the typical input specification is a set of minterms defining the on set and a set of minterms defining the don’t care set of a Boolean function. The problem is to synthesize an optimal set of product terms, or cubes, that covers all the minterms in the on set and some of the minterms in the don’t care set. In this paper, we consider a different specification: inst...
متن کاملOn the intersection of three or four transversals of the back circulant latin squares
Cavenagh and Wanless [Discrete Appl. Math. 158 no. 2 (2010), 136–146] determined the possible intersection of any two transversals of the back circulant latin square Bn, and used the result to completely determine the spectrum for 2-way k-homogeneous latin trades. We generalize this problem to the intersection of μ transversals of Bn such that the transversals intersect stably (that is, the int...
متن کاملThe intersection problem for cubes
For all integers m, nand t, we determine necessary and sufficient conditions for the existence of (1) a pair of 3-cube decompositions of Kn having precisely t common 3-cubes; and (2) a pair of 3-cube decompositions of Km,n having precisely t common 3-cubes.
متن کاملThe four-way intersection problem for latin squares
For μ given latin squares of order n, they have k intersection when they have k identical cells and n − k cells with mutually different entries. For each n ≥ 1 the set of integers k such that there exist μ latin squares of order n with k intersection is denoted by I[n]. In a paper by P. Adams et al. (2002), I[n] is determined completely. In this paper we completely determine I[n] for n ≥ 16. Fo...
متن کاملOrder reduction and μ-conservation law for the non-isospectral KdV type equation a with variable-coefficients
The goal of this paper is to calculate of order reduction of the KdV typeequation and the non-isospectral KdV type equation using the μ-symmetrymethod. Moreover we obtain μ-conservation law of the non-isospectral KdVtype equation using the variational problem method.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 23 شماره
صفحات -
تاریخ انتشار 2001